Homomorphic-Policy Attribute-Based Key Encapsulation Mechanisms
نویسندگان
چکیده
Attribute-Based Encryption (ABE) allows to target the recipients of a message according to a policy expressed as a predicate among some attributes. Ciphertext-policy ABE schemes can choose the policy at the encryption time. In this paper, we define a new property for ABE: homomorphic-policy. A combiner is able to (publicly) combine ciphertexts under different policies into a ciphertext under a combined policy (AND or OR). More precisely, using linear secret sharing schemes, we design Attribute-Based Key Encapsulation Mechanisms (ABKEM) with the Homomorphic-Policy property: given several encapsulations of the same keys under various policies, anyone can derive an encapsulation of the same key under any combination of the policies. As an application, in Pay-TV, this allows to separate the content providers that can generate the encapsulations of a session key under every attributes, this key being used to encrypt the payload, and the service providers that build the decryption policies according to the subscriptions. The advantage is that the aggregation of the encapsulations by the service providers does not contain any secret information.
منابع مشابه
Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles
We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of ...
متن کاملFully Dynamic Multi Target Homomorphic Attribute-Based Encryption
We propose multi target homomorphic attribute-based encryption (MT-HABE) with fully dynamic homomorphic evaluation: it can take as input arbitrary additional ciphertexts during homomorphic computation. In the previousMT-HABE of Brakerski et al. (TCC 2016-B), the output of homomorphic computation, which is related to a policy set, cannot be computedwith a fresh ciphertext whose attribute does no...
متن کاملAttribute-Based Authenticated Key Exchange
We introduce the concept of attribute-based authenticated key exchange (AB-AKE) within the framework of ciphertext policy attribute-based systems. A notion of AKE-security for AB-AKE is presented based on the security models for group key exchange protocols and also taking into account the security requirements generally considered in the ciphertext policy attribute-based setting. We also exten...
متن کاملTargeted Homomorphic Attribute-Based Encryption
In (key-policy) attribute based encryption (ABE), messages are encrypted respective to attributes x, and keys are generated respective to policy functions f . The ciphertext is decryptable by a key only if f(x) = 0. Adding homomorphic capabilities to ABE is a long standing open problem, with current techniques only allowing compact homomorphic evaluation on ciphertext respective to the same x. ...
متن کاملUniversally Composable Attribute-based Group Key Exchange
Several protocols implementing attribute-based group key exchange, which allows users with certain set of attributes to establish a session key, have been proposed in recent years. However, attacks on attribute-based group key exchange in current research have been considered only in stand-alone fashion. Thus these protocols may be vulnerable when run with other protocol sessions concurrently. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016